An algorithm to compute rotation intervals of circle maps

نویسندگان

چکیده

In this article we present an efficient algorithm to compute rotation intervals of circle maps degree one. It is based on the computation number a monotone map one with constant section. The main strength that it computes \emph{exactly} interval natural subclass continuous non-invertible maps. We also compare our other existing ones by plotting Devil's Staircase one-parameter family and Arnold Tongues some special non-differentiable families, most which were out reach algorithms centred around differentiable

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Circle Maps , Rotation Numbers

A lecture given at the Department of Biology, University of Oslo, at the \population dynamics seminar" 27.11.98.

متن کامل

Rotation sets for networks of circle maps.

We consider continuous maps of the torus, homotopic to the identity, that arise from systems of coupled circle maps and discuss the relationship between network architecture and rotation sets. Our main result is that when the map on the torus is invertible, network architecture can force the set of rotation vectors to lie in a low-dimensional subspace. In particular, the rotation set for an all...

متن کامل

Rotation Numbers for Measure-valued Circle Maps

We consider strong and weak topologies on the space of orbits from the unit interval to the set of probability measures on a given domain. In particular, we are interested in periodic orbits of probability measures on the circle. We show that a real-valued rotation number can be defined in a natural way for all smooth enough orbits whose range is composed of probability measures supported on th...

متن کامل

An Algorithm to Compute

The following problem is addressed: given square matrices A and B, compute the smallest such that A + E and B + F have a common eigenvalue for some E, F with max(‖E‖2, ‖F‖2) ≤ . An algorithm to compute this quantity to any prescribed accuracy is presented, assuming that eigenvalues can be computed exactly.

متن کامل

An Algorithm to Compute the Complexity of a Static Production Planning (RESEARCH NOTE)

Complexity is one of the most important issues of any production planning. The increase in complexity of production planning can cause inconsistency between a production plan and an actual outcome. The complexity generally can be divided in two categories, the static complexity and the dynamic complexity, which can be computed using the ant ropy formula. The formula considers the probability of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications in Nonlinear Science and Numerical Simulation

سال: 2021

ISSN: ['1878-7274', '1007-5704']

DOI: https://doi.org/10.1016/j.cnsns.2021.105915